PHORMA: Perfectly Hashed Order Restricted Multidimensional Arrays
نویسنده
چکیده
In this paper we propose a simple and efficient strategy to obtain a data structure generator to accomplish a perfect hash of quite general order restricted multidimensional arrays named phormas. The constructor of such objects gets two parameters as input: an n-vector a of non negative integers and a boolean function B on the types of order restrictions on the coordinates of the valid n-vectors bounded by a. At compiler time, the phorma constructor builds, from the pair a,B, a digraph G(a,B) with a single source s and a single sink t such that the st-paths are in 1− 1 correspondence with the members of the B-restricted a-bounded array A(a,B). Besides perfectly hashing A(a,B), G(a,B) is an instance of NW -family what permits other useful computational tasks on it.
منابع مشابه
PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array.
متن کاملPHORMA: Perfectly Hashed Order Restricted Multidimensional Array
In this paper we propose a simple and efficient strategy to obtain a data structure generator to accomplish a perfect hash of quite general order restricted multidimensional arrays named phormas. The constructor of such objects gets two parameters as input: an n-vector a of non negative integers and a boolean function B on the types of order restrictions on the coordinates of the valid n-vector...
متن کاملOn the Performance of Snake Partitioning: A Data Decomposition Technique that Reduces Communication and Exploits Locality
This paper presents performance results of a new data partitioning technique: snake partitioning , a data decomposition technique than can be derived at compile-time. Snake partitioning is suitable for multidimensional arrays with restricted aane references. The technique derives the data partitioning of these arrays and an execution order that exploits locality in loops. Experiments that compa...
متن کاملSome Remarks on Honeyword Based Password-Cracking Detection
Recently, Juels and Rivest proposed honeywords (decoy passwords) to detect attacks against hashed password databases. For each user account, the legitimate password is stored with several honeywords in order to sense impersonation. If honeywords are selected properly, an adversary who steals a file of hashed passwords cannot be sure if it is the real password or a honeyword for any account. Mor...
متن کاملcient Organization of Large Multidimensional Arrays
Large multidimensional arrays are widely used in scientiic and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and eecient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the ch...
متن کامل